package com.hspedu.tree;

/**
 * @author Charlie
 * @version 1.0
 * @date 2/11/2025 下午2:46
 */
public class BinaryTreeDemo {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        HeroNode root = new HeroNode(1, "宋江");
        HeroNode node2 = new HeroNode(2, "吴用");
        HeroNode node3 = new HeroNode(3, "卢俊义");
        HeroNode node4 = new HeroNode(4, "林冲");
        HeroNode node5 = new HeroNode(5, "关胜");

       root.setLeft(node2);
       root.setRight(node3);
       node3.setRight(node4);
       node3.setLeft(node5);
       binaryTree.setRoot(root);


       /* System.out.println("preOrder");
        binaryTree.preOrder();
        System.out.println("========");

        System.out.println("infixOrder");
        binaryTree.infixOrder();
        System.out.println("========");

        System.out.println("infixOrder");
        binaryTree.postOrder();*/

        /*HeroNode resNode = binaryTree.preOrderSearch(5);
        if(resNode!=null){
            System.out.printf("找到了信息no=%d name=%s",resNode.getNo(),resNode.getName());
        }else {
            System.out.printf("没有找到no=%d",5);
        }
*/
        System.out.println("删除前，前序遍历");
        binaryTree.preOrder();
        binaryTree.delNode(3);
        System.out.println("======================");
        System.out.println("删除后，前序遍历");
        binaryTree.preOrder();

    }




}

class BinaryTree{
    private HeroNode root;
    public void setRoot(HeroNode root){
        this.root=root;
    }


    //删除结点
    public void delNode(int no ){
        if(root!=null){
           //root是不是要删除的结点
            if(root.getNo()==no){
                root=null;

            }else {
                root.delNode(no);

            }

        }else {
            System.out.println("空树无法删除");
        }

    }

    public void preOrder(){
        if(this.root!=null){
            this.root.preOrder();
        }else {
            System.out.println("当前二叉树为空，无法遍历");
        }
    }

    public void infixOrder(){
        if(this.root!=null){
            this.root.infixOrder();
        }else {
            System.out.println("当前二叉树为空，无法遍历");
        }

    }

    public void postOrder(){
        if(this.root!=null){
            this.root.postOrder();
        }else {
            System.out.println("当前二叉树为空，无法遍历");
        }

    }

    //前序遍历
    public HeroNode preOrderSearch(int no){
        if(root!=null){
            return root.preOrderSearch(no);
        }else {
            return null;
        }
    }
   //中序遍历
    public HeroNode infixOrderSearch(int no){
        if(root!=null){
            return root.infixOrderSearch(no);
        }else {
            return null;
        }
    }

    //后序遍历
    public HeroNode postOrderSearch(int no){
        if(root!=null){
            return root.postOrderSearch(no);
        }else {
            return null;
        }
    }


}

class HeroNode{
    private int no;
    private String name;
    private HeroNode left; //默认为空
    private HeroNode right; // 默认为控

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public HeroNode getLeft() {
        return left;
    }

    public void setLeft(HeroNode left) {
        this.left = left;
    }

    public HeroNode getRight() {
        return right;
    }

    public void setRight(HeroNode right) {
        this.right = right;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }

    public void delNode(int no){


        if(this.left!=null&&this.left.no==no){
            this.left=null;
            return;
        }
        if(this.right!=null && this.right.no==no){
            this.right=null;
            return;
        }
        if(this.left!=null){
            this.left.delNode(no);
        }
        if(this.right!=null){
            this.right.delNode(no);
        }



    }

    //编写前序遍历
    public void preOrder(){
        System.out.println(this); //  output the parentNode
        //递归向左子树遍历
        if(this.left!=null){
            this.left.preOrder();
        }
        if(this.right!=null){
            this.right.preOrder();
        }
    }


    public void infixOrder(){
        if(this.left!=null){
            this.left.infixOrder();
        }
        System.out.println(this);
        if(this.right!=null){
            this.right.infixOrder();
        }
    }

    public void postOrder(){
        if(this.left!=null){
            this.left.postOrder();
        }

        if(this.right!=null){
            this.right.postOrder();
        }

        System.out.println(this);

    }
   /*no 雇员编号
   * */
    public HeroNode preOrderSearch(int no){
        //比较当前节点是不是
        if(this.no==no){
            return this;
        }
        HeroNode resNode=null;
        if(this.left!=null){
            resNode=this.left.preOrderSearch(no);
        }
        if(resNode!=null){ //说明左边找到
            return resNode;
        }

        if(this.right!=null){
            resNode=this.right.preOrderSearch(no);
        }
        if(resNode!=null){
            return resNode;
        }
        return null;

    }



    public HeroNode infixOrderSearch(int no){

        HeroNode resNode=null;

        if(this.left!=null){
             resNode=this.left.infixOrderSearch(no);
        }
        if(resNode!=null){
            return resNode;
        }
        //
        if(this.no==no){
            return this;
        }
        if(this.right!=null){
            resNode=this.right.infixOrderSearch(no);
        }
        return resNode;

    }


    public HeroNode postOrderSearch(int no){
        HeroNode resNode=null;
      if(this.left!=null){
          resNode=this.left.postOrderSearch(no);
      }
      if(resNode!=null){
          return resNode;
      }

      if(this.right!=null){
          resNode=this.right.postOrderSearch(no);
      }
      if(resNode!=null){
          return resNode;
      }
      //如果左右都没有找到，就比较当前节点是不是
        if(this.no==no){
            return this;
        }
       return resNode;
    }


}
